Reduction Rules for YAWL Workflow Nets with Cancellation Regions and OR-joins

A reduction rule can transform a large net into a smaller and simple net while preserving certain interesting properties and it is usually applied before verification to reduce the complexity and to prevent state space explosion. Reset nets have been proposed to formally describe workflows with cancellation behaviour. In our previous work, we have presented a set of reduction rules for Reset Workflow Net (RWF-net), which is a subclass of reset nets. In this paper, we will present a set of reduction rules for YAWL nets with cancellation regions and OR-joins. The reduction rules for RWF-nets combined with the formal mappings from YAWL nets provide us with the means to define a set of reduction rules for YAWL nets. We will also demonstrate how these reduction rules can be used for efficient verification of YAWL nets these features.